Algebraic and algorithmic aspects of radical parametrizations

نویسندگان

  • J. Rafael Sendra
  • David Sevilla
  • Carlos Villarino
چکیده

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, n variables, the four field operations and radical extractions). We provide algorithms to implicitize radical parametrizations and to check whether a radical parametrization can be reparametrized into a rational parametrization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First steps towards radical parametrization of algebraic surfaces

We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree minus 4) singularity, all irreducible surfaces of degree at most 5, all irreducible singular surfaces of degree 6, and surfaces containing a pencil of low-genus ...

متن کامل

On Symbolic Solutions of Algebraic Partial Differential Equations

In this paper we present a general procedure for solving first-order autonomous algebraic partial differential equations in two independent variables. The method uses proper rational parametrizations of algebraic surfaces and generalizes a similar procedure for first-order autonomous ordinary differential equations. We will demonstrate in examples that, depending on certain steps in the procedu...

متن کامل

Experimental Evaluation of Algorithmic Effort Estimation Models using Projects Clustering

One of the most important aspects of software project management is the estimation of cost and time required for running information system. Therefore, software managers try to carry estimation based on behavior, properties, and project restrictions. Software cost estimation refers to the process of development requirement prediction of software system. Various kinds of effort estimation patter...

متن کامل

RADICAL OF FILTERS IN RESIDUATED LATTICES

‎In this paper‎, ‎the notion of the radical of a filter in‎ ‎residuated lattices is defined and several characterizations of‎ ‎the radical of a filter are given‎. ‎We show that if F is a‎ ‎positive implicative filter (or obstinate filter)‎, ‎then‎ ‎Rad(F)=F‎. ‎We proved the extension theorem for radical of filters in residuated lattices‎. ‎Also‎, ‎we study the radical‎ ‎of filters in linearly o...

متن کامل

Efficient detection of symmetries of polynomially parametrized curves

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on an algebraic relationship between proper parametrizations of a same curve, which leads to a triangular polynomial system that can be solved in a very fast way; in particular, curves parametrized by polynomials of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2017